of Informatics The 2 - hop spanning tree problem . Geir Dahl

نویسنده

  • Geir Dahl
چکیده

Given a graph G with a speci ed root node r. A spanning tree in G where each node has distance at most 2 from r is called a 2-hop spanning tree. For given edge weights the 2-hop spanning tree problem is to nd a minimum weight 2-hop spanning tree. The problem is NP-hard and has some interesting applications. We study a polytope associated with a directed model of the problem give a completeness result for wheels and a vertex description of a linear relaxation. Some classes of valid inequalities for the convex hull of incidence vectors of 2-hop spanning trees are derived by projection techniques.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The 2 - hop spanning tree problem . Geir Dahl

Given a graph G with a speciied root node r. A spanning tree in G where each node has distance at most 2 from r is called a 2-hop spanning tree. For given edge weights the 2-hop spanning tree problem is to nd a minimum weight 2-hop spanning tree. The problem is NP-hard and has some interesting applications. We study a polytope associated with a directed model of the problem give a completeness ...

متن کامل

The 2-hop spanning tree problem

Given a graph G with a speciied root node r. A spanning tree in G where each node has distance at most 2 from r is called a 2-hop spanning tree. For given edge weights the 2-hop spanning tree problem is to nd a minimum weight 2-hop spanning tree. The problem is NP-hard and has some interesting applications. We study a polytope associated with a directed model of the problem give a completeness ...

متن کامل

SOLVING A STEP FIXED CHARGE TRANSPORTATION PROBLEM BY A SPANNING TREE-BASED MEMETIC ALGORITHM

In this paper, we consider the step fixed-charge transportation problem (FCTP) in which a step fixed cost, sometimes called a setup cost, is incurred if another related variable assumes a nonzero value. In order to solve the problem, two metaheuristic, a spanning tree-based genetic algorithm (GA) and a spanning tree-based memetic algorithm (MA), are developed for this NP-hard problem. For compa...

متن کامل

A Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem

The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998